Formalization of Work ows and Correctness
نویسندگان
چکیده
In this paper, main components of a workkow system that are relevant to the cor-rectness in the presence of concurrency are formalized based on set theory and graph theory. The formalization which constitutes the theoretical basis of the correctness criterion provided can be summarized as follows: Activities of a workkow are represented through a notation based on set theory to make it possible to formalize the conceptual grouping of activities. Control-ow is represented as a special graph based on this set deenition, and it includes serial composition, parallel composition, conditional branching, and nesting of individual activities and conceptual activities themselves. Data-ow is represented as a directed acyclic graph in conformance with the control-ow graph. The formalization of correctness of concurrently executing workkow instances is based on this framework by deening two categories of constraints on the workkow environment with which the workkow instances and their activities interact. These categories are: Basic constraints that specify the correct states of a workkow environment. Inter-activity constraints that deene the semantic dependencies among activities such as an activity requiring the validity of a constraint that is set or veriied by a preceding activity. Basic constraints graph and inter-activity constraints graph which are in conformance with the control-ow and data-ow graphs are then deened to represent these constraints. These graphs are used in formalizing the intervals among activities where an inter-activity constraint should be maintained and the intervals where a basic constraint remains invalid. A correctness criterion is deened for an interleaved execution of workkow instances using the constraints graphs. A concurrency control mechanism, namely Constraint Based Concurrency Control technique is developed based on the correctness criterion. The performance analysis shows the superiority of the proposed technique. Other possible approaches to the problem are also presented.
منابع مشابه
Correctness of Work ows in the Presence of Concurrency
Work ow processes are long duration activities and therefore it is not possible to apply the well accepted correctness techniques of transactions directly to work ow systems In this paper we rst mention the correctness problems of work ow systems and then exploit the available seman tics in work ow speci cation in the form of data and serial control ow dependencies to de ne isolation units We s...
متن کاملCorrectness of Workflow in the Presence of Concurrency
Work ow processes are long duration activities and therefore it is not possible to apply the well accepted correctness techniques of transactions directly to work ow systems In this paper we rst mention the correctness problems of work ow systems and then exploit the available seman tics in work ow speci cation in the form of data and serial control ow dependencies to de ne isolation units We s...
متن کاملFormalization of Abstract State Transition Systems for SAT
We present a formalization of modern SAT solvers and their properties in a form of abstract state transition systems. SAT solving procedures are described as transition relations over states that represent the values of the solver’s global variables. Several different SAT solvers are formalized, including both the classical DPLL procedure and its state-of-the-art successors. The formalization i...
متن کاملA Formalization of the Theorem of Existence of First-Order Most General Unifiers
This work presents a formalization of the theorem of existence of most general unifiers in first-order signatures in the higher-order proof assistant PVS. The distinguishing feature of this formalization is that it remains close to the textbook proofs that are based on proving the correctness of the wellknown Robinson’s first-order unification algorithm. The formalization was applied inside a P...
متن کاملWhat do Advanced Transaction Models Have to O er for Work ows
Work ow management systems are nding wide applicability in small and large organiza tional settings In this paper we brie y review four large scale applications to gauge their mod eling and run time requirements Advanced transaction models ATM focus on maintaining data consistency and have provided solutions to many problems such as correctness consistency and reliability in transaction process...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998